Preprint: Interestingness Measures for Fixed Consequent Rules

نویسندگان

  • Jon Hills
  • Luke M. Davis
  • Anthony Bagnall
چکیده

Many different rule interestingness measures have been proposed in the literature; we show that, under two assumptions, at least twelve of these measures are proportional to Confidence. We consider rules with a fixed consequent, generated from a fixed data set. From these assumptions, we prove that Satisfaction, Ohsaki’s Conviction, Added Value, Brin’s Interest/Lift/Strength, Brin’s Conviction, Certainty Factor/Loevinger, Mutual Information, Interestingness, Sebag-Schonauer, Ganascia Index, Odd Multiplier, and Example/counter-example Rate are all monotonic with respect to Confidence. Hence, for ordering sets of partial classification rules with a fixed consequent, the Confidence measure is equivalent to any of the twelve other measures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

Selecting a Right Interestingness Measure for Rare Association Rules

In the literature, the properties of several interestingness measures have been analyzed and a framework has been proposed for selecting a right interestingness measure for extracting association rules. As rare association rules contain useful knowledge, researchers are making efforts to investigate efficient approaches to extract the same. In this paper, we make an effort to analyze the proper...

متن کامل

Evaluating the Interestingness of Characteristic Rules

Knowledge Discovery Systems can be used to generate classification rules describing data from databases. Typically, only a small fraction of the rules generated may actually be of interest. Measures of rule intemstingness allow us to filter out less interesting rules. Classification rules may be discriminant (e + h) or characteristic (h + e), where e is evidence, and h is an hypothesis. For dis...

متن کامل

Defining Interestingness for Association Rules

Interestingness in Association Rules has been a major topic of research in the past decade. The reason is that the strength of association rules, i.e. its ability to discover ALL patterns given some thresholds on support and confidence, is also its weakness. Indeed, a typical association rules analysis on real data often results in hundreds or thousands of patterns creating a data mining proble...

متن کامل

Algorithms and Measures in Sequence Data Mining

Sequential pattern mining, first introduced in [1], is one of the most challenging problems in data mining [3]. It aims to extract the relationships between occurrences of sequential itemsets i.e. to look for any specific order of the itemsets. Sequential pattern mining has large applications, such as the analysis of DNA sequences, stock marketing, web access patterns, transactional databases, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012